'
Let Σ = {a, b}. Write a regular expression for the language L consisting of all strings in Σ∗ with exactly one occurrence of the substring aaa.